“Look-Ahead” Soft-Decision Decoding of Binary Reed-Muller Codes
نویسندگان
چکیده
We investigate the performance of a stack algorithm to decode binary Reed-Muller codes. As metric to evaluate the different elements in the stack we use a recently derived lower bound on the squared Euclidean distance. Similar to the A -algorithm the new metric comprises a lower bound on the increase of the squared Euclidean distance in future decoding steps. Simulation results show that in case of the codes RM(3; 8) and RM(4; 8) even at low SNR close to soft-decision ML-decoding performance can be achieved with reasonable stack size.
منابع مشابه
Soft-Decision Stack Decoding of Binary Reed-Muller Codes with “Look-Ahead” Technique
The performance of a stack algorithm to decode binary Reed-Muller codes is investigated. As metric to evaluate the different elements in the stack we use a recently derived lower bound on the squared Euclidean distance. It comprises a lower bound on the metric increase in future decoding steps, similar to the A -algorithm. Simulation results show that in case of the code RM(3; 8) at a WER of 10...
متن کاملSoft-decision decoding of Reed-Muller codes as generalized multiple concatenated codes
In this paper, we present a new soft-decision decoding algorithm for Reed-Muller codes. It is based on the GMC decoding algorithm proposed by Schnabl and Bossert [1] which interprets Reed-Muller codes as generalized multiple concatenated codes. We extend the GMC algorithm to list-decoding (L-GMC). As a result, a SDML decoding algorithm for the first order Reed-Muller codes is obtained. Moreover...
متن کاملMaximum-likelihood Soft-decision Decoding for Binary Linear Block Codes Based on Their Supercodes
Based on the notion of supercodes, we propose a two-phase maximum-likelihood soft-decision decoding (tpMLSD) algorithm for binary linear block codes in this work. The first phase applies the Viterbi algorithm backwardly to a trellis derived from the parity-check matrix of the supercode of the linear block code. Using the information retained from the first phase, the second phase employs the pr...
متن کاملoft-decision majority decoding of Reed-Muller codes
We present a new soft-decision majority decoding algorithm for Reed–Muller codes RM ( ). First, the reliabilities of 2 transmitted symbols are recalculated into the reliabilities of 2 parity checks that represent each information bit. In turn, information bits are obtained by the weighted majority that gives more weight to more reliable parity checks. It is proven that for long low-rate codes R...
متن کاملSufficient Conditions for Ruling-Out Useless Iterative Steps in a Class of Iterative Decoding Algorithms
In this paper, we consider sufficient conditions for ruling out some useless iteration steps in a class of softdecision iterative decoding algorithms for binary block codes used over the AWGN channel using BPSK signaling. Sufficient conditions for ruling out the next single decoding step, called ruling-out conditions and those for ruling out all the subsequent iteration steps, called early term...
متن کامل